#include <bits/stdc++.h>

#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 510;

int n, m, ans, e;
bool hav[N][N], vis[N];
int mat[N];

bool match(int x) {
	if(vis[x]) return false; vis[x] = true;
	rep(i, 1, m) if(hav[x][i] && (!mat[i] || match(mat[i]))) return mat[i] = x, true;
	return false;
}

int main() {
#ifdef YJR_2333_TEST
	freopen("1.in", "r", stdin);
#endif
	n = in, m = in, e = in;
	rep(i, 1, e) { int u = in, v = in; hav[u][v] = true; }
	rep(i, 1, n) {
		if(match(i)) ans += 1;
		memset(vis, 0, sizeof vis);
	}
	cout << ans << endl;
	return 0;
}
